Observation of String-Rewriting Systems
نویسندگان
چکیده
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain a protocol of the entire process and then use this as the computation’s result. In a series of articles this approach has proved to often exceed greatly the power of the system observed. Here we apply this architecture to string-rewriting systems. They receive a string as input, and a combination of observer and decider then determines whether this string is accepted. This decision is based only on the rewriting process performed. First we determine the powers of painter, contextfree, and inverse context-free rewriting systems in terms of McNaughton languages. Then these are investigated as components of rewriting/observer systems, and we obtain characterizations of the context-sensitive and the recursively enumerable languages. Finally we investigate some limitations, i.e. characterize some systems, where observation does not increase power.
منابع مشابه
Undecidable Properties on Length-Two String Rewriting Systems
Length-two string rewriting systems are length preserving string rewriting systems that consist of length-two rules. This paper shows that confluence, termination, left-most termination and right-most termination are undecidable properties for length-two string rewriting systems. This results mean that these properties are undecidable for the class of linear term rewriting systems in which dept...
متن کاملLynch-Morawska Systems on Strings
We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in [8] by Christopher Lynch and Barbara Morawska (we call these LM-Systems). Since a string rewriting system can be viewed as a term-rewriting system over a signature of purely monadic function symbols, we adapt their definition to the string rewriting case. We...
متن کاملUniversit a Di Pisa from String Rewriting to Logical Metabolic Systems from String Rewriting to Logical Metabolic Systems
متن کامل
On Properties of Monoids That Are Modular for Free Products and for Certain Free Products with Amalgamated Submonoids
A property P of string-rewriting systems is called modular if the disjoint union R 1 R 2 of two string-rewriting systems R 1 and R 2 has this property if and only if R 1 and R 2 both have this property. Analogously, a property P of monoids is modular if the free product M 1 M 2 of two monoids M 1 and M 2 has this property if and only if M 1 and M 2 both have this property. Since the string-rewr...
متن کاملReachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in reachability: given a rewriting system R and words v and w, can v be rewritten to w by applying rules from R? A famous result states that reachability is decidable for commutative string rewriting systems. We show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 74 شماره
صفحات -
تاریخ انتشار 2006